Recursive computation of generalised Zernike polynomials
نویسندگان
چکیده
منابع مشابه
Recursive formula to compute Zernike radial polynomials.
In optics, Zernike polynomials are widely used in testing, wavefront sensing, and aberration theory. This unique set of radial polynomials is orthogonal over the unit circle and finite on its boundary. This Letter presents a recursive formula to compute Zernike radial polynomials using a relationship between radial polynomials and Chebyshev polynomials of the second kind. Unlike the previous al...
متن کاملComputation of fluctuation scattering profiles via three-dimensional Zernike polynomials.
Ultrashort X-ray pulses from free-electron laser X-ray sources make it feasible to conduct small- and wide-angle scattering experiments on biomolecular samples in solution at sub-picosecond timescales. During these so-called fluctuation scattering experiments, the absence of rotational averaging, typically induced by Brownian motion in classic solution-scattering experiments, increases the info...
متن کاملOrthogonality of Zernike Polynomials
Zernike polynomials are an orthogonal set over a unit circle and are often used to represent surface distortions from FEA analyses. There are several reasons why these coefficients may lose their orthogonality in an FEA analysis. The effects, their importance, and techniques for identifying and improving orthogonality are discussed. Alternative representations are presented.
متن کاملQuaternion Zernike spherical polynomials
Abstract. Over the past few years considerable attention has been given to the role played by the Zernike polynomials (ZPs) in many di↵erent fields of geometrical optics, optical engineering, and astronomy. The ZPs and their applications to corneal surface modeling played a key role in this development. These polynomials are a complete set of orthogonal functions over the unit circle and are co...
متن کاملOptimal sampling patterns for Zernike polynomials
A pattern of interpolation nodes on the disk is studied, for which the interpolation problem is theoretically unisolvent, and which renders a minimal numerical condition for the collocation matrix when the standard basis of Zernike polynomials is used. It is shown that these nodes have an excellent performance also from several alternative points of view, providing a numerically stable surface ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2017
ISSN: 0377-0427
DOI: 10.1016/j.cam.2015.11.017